A Jordan-algebraic approach to potential-reduction algorithms
نویسنده
چکیده
We consider the linear monotone complementarity problem for domains obtained as the intersection of an aane subspace and the Cartesian product of symmetric cones. A primal-dual potential reduction algorithm is described and its complexity estimates are established with the help of the Jordan-algebraic technique .
منابع مشابه
Kinetic Mechanism Reduction Using Genetic Algorithms, Case Study on H2/O2 Reaction
For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...
متن کاملAddendum to: "Infinite-dimensional versions of the primary, cyclic and Jordan decompositions", by M. Radjabalipour
In his paper mentioned in the title, which appears in the same issue of this journal, Mehdi Radjabalipour derives the cyclic decomposition of an algebraic linear transformation. A more general structure theory for linear transformations appears in Irving Kaplansky's lovely 1954 book on infinite abelian groups. We present a translation of Kaplansky's results for abelian groups into the terminolo...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملPrimal-dual algorithms and infinite-dimensional Jordan algebras of finite rank
We consider primal-dual algorithms for certain types of infinite-dimensional optimization problems. Our approach is based on the generalization of the technique of finite-dimensional Euclidean Jordan algebras to the case of infinite-dimensional JB-algebras of finite rank. This generalization enables us to develop polynomial-time primal-dual algorithms for “infinite-dimensional second-order cone...
متن کاملThe Jordan Structure of Residual Dynamics Used to Solve Linear Inverse Problems
With a detailed investigation of n linear algebraic equations Bx = b, we find that the scaled residual dynamics for y ∈ Sn−1 is equipped with four structures: the Jordan dynamics, the rotation group SO(n), a generalized Hamiltonian formulation, as well as a metric bracket system. Therefore, it is the first time that we can compute the steplength used in the iterative method by a novel algorithm...
متن کامل